New mixed Moore graphs and directed strongly regular graphs

نویسنده

  • Leif K. Jørgensen
چکیده

A directed strongly regular graph with parameters (n, k, t, λ, μ) is a k-regular directed graph with n vertices satisfying that the number of walks of length 2 from a vertex x to a vertex y is t if x = y, λ if there is an edge directed from x to y and μ otherwise. If λ = 0 and μ = 1 then we say that it is a mixed Moore graph. It is known that there are unique mixed Moore graphs with parameters (k2 + k, k, 1, 0, 1), k ≥ 2, and (18, 4, 3, 0, 1). We construct a new mixed Moore graph with parameters (108, 10, 3, 0, 1) and also new directed strongly regular graphs with parameters (36, 10, 5, 2, 3) and (96, 13, 5, 0, 2). This new graph on 108 vertices can also be seen as an example of a so called multipartite Moore digraph. Finally we consider the possibility that mixed Moore graphs with other parameters could exist, in particular the first open case which is (40, 6, 3, 0, 1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

Approaching the mixed Moore bound for diameter two by Cayley graphs

In a mixed (Δ, d)-regular graph, every vertex is incident with Δ ≥ 1 undirected edges and there are d ≥ 1 directed edges entering and leaving each vertex. If such a mixed graph has diameter 2, then its order cannot exceed (Δ+ d) + d+1. This quantity generalizes the Moore bounds for diameter 2 in the case of undirected graphs (when d = 0) and digraphs (when Δ = 0). For every d such that d − 1 is...

متن کامل

Small vertex-transitive directed strongly regular graphs

We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...

متن کامل

On Mixed Almost Moore Graphs of Diameter Two

Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extremal mixed graphs, in the sense that their order is one less than the Moore bound for mixed graphs. The problem of their existence has been considered before for directed graphs and undirected ones, but not for the mixed case, which is a kind of generalization. In this paper we give some necessary c...

متن کامل

Representations of directed strongly regular graphs

We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 338  شماره 

صفحات  -

تاریخ انتشار 2015